Distributed Query Processing in P2P Systems with Incomplete Schema Information
نویسندگان
چکیده
The peer-to-peer (P2P) paradigm has emerged recently, mainly by file sharing systems like Napster or Gnutella and in terms of scalable distributed data structures. Because of the decentralization P2P systems promise an improved scalability and robustness, and they open a new view on data integration approaches, too. By exploiting already available mappings between pairs of peers a new peer joining the systems can immediately participate and access all the available data after establishing a correspondence mapping to at least one other peer. One of the technical challenges in building scalable P2P based integration systems is the efficient processing of queries which is complicated by the locally restricted knowledge about data placement and schema information. In this paper, we address this problem by investigating query processing strategies dealing with incomplete schemas and present results of our experimental evaluation.
منابع مشابه
Processing and Optimization of Complex Queries in Schema-Based P2P-Networks
Peer-to-Peer infrastructures are emerging as one of the important data management infrastructures in the World Wide Web. So far, however, most work has focused on simple P2P networks which tackle efficient query distribution to a large set of peers but assume that each query can be answered completely at each peer. For queries which need data from more than one peer to be executed this is clear...
متن کاملSemantic Query Routing and Distributed Top-k Query Processing in Peer-to-Peer Networks
Requirements for widely distributed information systems supporting virtual organizations have given rise to a new category of peer-to-peer (p2p) systems called schema-based. In such systems each peer is a database management system in itself, exposing its own schema. In such a setting, a main objective is the efficient search across peer databases by processing each incoming query without overl...
متن کاملDistributed Queries and Query Optimization in Schema-Based P2P-Systems
Databases have employed a schema-based approach to store and retrieve structured data for decades. For peer-to-peer (P2P) networks, similar approaches are just beginning to emerge, also motivated by the fact, that sending (atomic) queries to the appropriate peers clearly fails for queries which need data from more than one peer to be executed. While quite a few database techniques can be re-use...
متن کاملA research agenda for query processing in large-scale peer data management systems
Peer Data Management Systems (PDMS) are a novel, useful, but challenging paradigm for distributed data management and query processing. Conventional integrated information systems have a hierarchical structure with an integration component that manages a global schema and distributes queries against this schema to the underlying data sources. PDMS are a natural extension to this architecture by...
متن کاملDistributed RDF Query Processing and Reasoning in Peer-to-Peer Networks
With the interest in Semantic Web applications rising rapidly, the Resource Description Framework (RDF) and its accompanying vocabulary description language, RDF Schema (RDFS), have become one of the most widely used data models for representing and integrating structured information in the Web. RDF provides a simple and abstract knowledge representation for resources on the Web, while RDFS def...
متن کامل